An Introduction to Decidability of DPDA Equivalence
نویسنده
چکیده
منابع مشابه
Schema Revisited
Two schema problems from the 1970s are examined, monadic recursion schemes and first-order recursion schemas. Research on these problems halted because they were shown to be equivalent to the problem of decidability of language equivalence between DPDA (deterministic pushdown automata). Recently a decidability proof for equivalence of DPDA was given by Sénizergues [10, 11], which therefore also...
متن کاملDecision Problems for Deterministic Pushdown Automata on Infinite Words
The article surveys some decidability results for DPDAs on infinite words (ω-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak ω-DPDAs. Furthermore, we present some new results on the parity index problem for ωDPDAs. For the specification of a parity condition, the states of the omega-DPDA are assigned priorities (nat...
متن کاملDecidability of DPDA equivalence
A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars.
متن کاملA Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars
The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famousproblem solved by G. Sénizergues, for which C. Stirling has derived a primitive recursive complexity upper bound. The proof here is given in the framework of first-order grammars, which seems to be particularly apt for the aim.
متن کاملNote on Undecidability of Bisimilarity for Second-Order Pushdown Processes
Broadbent and Göller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by ε-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender’s forcing, and the related undecidability proof for first-order pushdown automata with ε-transitions (Jančar and Srba, JACM 2008). Language equivalence of pushdown auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001